优化端点条件的平面二次均匀B样条插值曲线

在利用反求法构造B样条插值曲线时，往往需要选取端点条件。 因此，可对端点条件进行优化选取，使得构造的B样条插值曲线满足特定要求。提出了一种利用曲线内能极小选取平面二次均匀B样条插值曲线端点条件的算法。首先给出了二次均匀B样条插值曲线分控制顶点与首个控制顶点（即端点条件）的递推关系式；然后给出了利用曲线内能极小优化选取首个控制顶点的算法，证明了利用该算法构造的C¹连续二次均匀B样条插值曲线为保形插值，并通过数值算例证明了算法的有效性；最后，为便于实际应用，基于MATLAB平台设计了算法所对应的图形用户界面，用户通过简单的操作即可获得光顺的C¹连续二次均匀B样条保形插值曲线。     

A mathematical model for the 3d location estimation of 2D echocardiography data

The recovery of 3D left ventricle(LV) shape using 2D echocardiography is very attractable topic in the field of ultrasound imaging. In this paper, we propose a mathematical model to determine the 3D position of LV contours extracted from multiple 2D echocardiography images. We formulate the proposed model as a non-convex constrained minimization problem. To solve it, we propose a proximal alternating minimization algorithm with a solver OPTI for quadratically constrained quadratic program. For validating the proposed model, numerical experiments are performed with real ultrasound data. The experimental results show that the proposed model is promising and available for real echocardiography data.     

A note on submodular function minimization by Chubanov’s LP algorithm

Recently Dadush et al. (2017) have devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear programming feasibility algorithm of Chubanov (2017) to stimulate further research on SFM.     

Algorithm of Barrier Objective Penalty Function

In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm.     

Thioether‐derived Macrocycle for Peptide Secondary Structure Fixation

Recently, we developed methods to stabilize peptides into various secondary structures, including α‐helix, type III turn and β‐hairpin via proper thioether based macrocyclization. These conformationally constrained peptidomimetics confer enhanced biophysical properties and provide a valuable avenue towards clinically‐relevant therapeutic molecules. In this personal account, thioether‐derived macrocyclization methods developed by our group for stabilization of α‐helix, type‐III β turn and β‐hairpin conformations are discussed.     

太阳帆塔轨道和姿态耦合动力学建模及辛求解

在建立太阳帆塔太阳能电站简化模型的基础上,将系统的动力学方程从Lagrange体系导入到了Hamilton体系,给出了带约束的Hamilton正则方程;进而采用祖冲之类算法和辛Runge-Kutta方法分析了太阳帆塔轨道和姿态耦合系统的动力学特性,并讨论了算法的保能量、保约束特性;最后,数值模拟了系统的动力学特性,说明了所提方法的有效性.     

Recursion relations for the constrained multi-component KP hierarchy

In this paper, we define a new constrained multi-component KP(cMKP) hierarchy which contains the constrained KP(cKP) hierarchy as a special case. We derive the recursion operator of the constrained multi-component KP hierarchy. As a special example, we also give the recursion operator of the constrained two-component KP hierarchy.     

电磁约束阻尼层结构振动主动控制研究

基于弹性、粘弹性、电磁学理论,应用Hamilton原理,导出了覆盖电磁约束层阻尼(EMCLD)主动控制方式的梁的控制方程,并针对覆盖EMCLD的悬臂梁,进行了主动控制仿真模拟,得到了较好的控制效果,分析了控制电流和阻尼层厚度对控制效果的影响.结果表明电磁约束阻尼技术具有结构简单、作动方式合理、耗能低的优点,是一种有效的振动主动控制方式.     

Optimization of support positions to minimize the maximal deflection of structures

In this paper, the design sensitivity analysis for the deflection of a beam or plate structure is first investigated with respect to the position of a simple support using the discrete method. Both elastic and rigid supports are taken into account, and closed-form formulae for the deflection sensitivity are developed straightforwardly. Then, on the basis of the design sensitivity analysis, a heuristic optimization algorithm, called the evolutionary shift method, is presented for support position optimization to minimize the maximal deflection of a structure with a fixed grid mesh scheme. In each iterative loop, the support with the highest efficiency is shifted in priority. To facilitate the convergence of the process, a polynomial interpolation technique is employed to evaluate the solution more accurately. The optimal solution is achieved gradually with a minimum modification of the support layout design. Finally, three numerical examples are presented to demonstrate the validities of the sensitivity analysis and the optimization method. Results show that support optimization can improve the structural behavior significantly.